On the isomorphism problem for decision trees and decision lists

On the Isomorphism Problem for Decision Trees and Decision Lists

We study the complexity of isomorphism testing for boolean functions that are represented by decision trees or decision lists. Our results are the following: • Isomorphism testing of rank 1 decision trees is complete for logspace. • For any constant r ≥ 2, isomorphism testing for rank r decision trees is polynomial-time equivalent to Graph Isomorphism. As a consequence of our reduction, we obta...

Pruning Decision Trees and Lists

Machine learning algorithms are techniques that automatically build models describing the structure at the heart of a set of data. Ideally, such models can be used to predict properties of future data points and people can use them to analyze the domain from which the data originates. Decision trees and lists are potentially powerful predictors and embody an explicit representation of the struc...

Pruning Decision Trees and Lists

The multi-objective decision making methods based on MULTIMOORA and MOOSRA for the laptop selection problem

A decision making process requires the values of conflicting objectives for alternatives and the selection of the best alternative according to the needs of decision makers. Multi-objective optimization methods may provide solution for this selection. In this paper it is aimed to present the laptop selection problem based on MOORA plus full multiplicative form (MULTIMOORA) and multi-objective o...

Decision Trees for Decision Making

If the company builds a big plant, it must live with it whatever the size of market demand. If it builds a small plant, management has the option of expanding the plant in two years in the event that demand is high during the introductory period; while in the event that demand is low during the introductory period, the company will maintain operations in the small plant and make a tidy profit o...